Performance Analysis of Keccak f-[1600]

Keccak is the latest Hash Function selected as the winner of NIST Hash Function Competition. SHA-3 is not meant to replace SHA-2 as no significant attacks on SHA-2 have been demonstrated. But it is designed in response to the need to find an alternative and dissimilar construct for Cryptographic Hash that is more fortified to attacks. In this paper we have tried to depict an analysis of the software implementation of Keccakf[1600] based on the disk space utilization and time required to compute digest of desired sizes. Keywords—Sponge Construction; State; Rounds; Bitrate(r); Capacity(c); Diversifier(d); Plane; Slice; Sheet; Row; Column; Lane; Bit I. BACKGROUND Distributed Computing and Network Communication has revolutionized the face of modern computing. But it brings with it serious security concerns like verifying the integrity and authenticity of the transmitted data. The sender and the receiver communicating over an insecure channel essentially require a method by which the information transmitted by the sender can be easily authenticated by the receiver as “unmodified” or authentic. To achieve this, technique called “Hashing” is employed which relies on a family of Hash Functions. Keccak is one such Hash Function which is selected as the winner of NIST Hash Function Competition. I